135A - Replacement - CodeForces Solution

from collections import defaultdict
import math
import sys 
from bisect import bisect_right

def clc():
    n = int(input())
    arr=  list(map(int,input().split()))
    arr = sorted(arr)
    
    if arr[n-1] == 1:
        arr[n-1] = 2
    else:arr[n-1] = 1
    arr = sorted(arr)
    for i in range(n):
        print(arr[i],end= " ")
    return True
cc = clc()

if not cc :
    print(-1)